منابع مشابه
Decomposition by maxclique separators
We provide a minimal counterexample to the correctness of an algorithm proposed by R. Tarjan for decomposing a graph by maximal clique separators. We also suggest a modification to that algorithm which not only corrects it but also retains its O(nm) time complexity.
متن کاملVertical Decomposition of a Lattice Using Clique Separators
A concept (or Galois) lattice is built on a binary relation; this relation can be represented by a bipartite graph. We explain how we can use the graph tool of clique minimal separator decomposition to decompose some bipartite graphs into subgraphs in linear time; each subgraph corresponds to a subrelation. We show that the lattices of these subrelations easily yield the lattice of the global r...
متن کاملBattery separators.
The ideal battery separator would be infinitesimally thin, offer no resistance to ionic transport in electrolytes, provide infinite resistance to electronic conductivity for isolation of electrodes, be highly tortuous to prevent dendritic growths, and be inert to chemical reactions. Unfortunately, in the real world the ideal case does not exist. Real world separators are electronically insulati...
متن کاملTowards a Dynamic Decomposition of CSPs with Separators of Bounded Size
In this paper, we address two key aspects of solving methods based on tree-decomposition. First, we propose an algorithm computing decompositions that allows to bound the size of separators, which is a crucial parameter to limit the space complexity, and thus the feasibility of such methods. Moreover, we show how it is possible to dynamically modify the considered decomposition during the searc...
متن کاملLine and Plane Separators
We consider sparse matrices arising from nite-element or nite-diierence methods. The graphs of such matrices are embedded in two or three dimensional Euclidean space, and the coordinates of their vertices are readily available. Such coordinate information was used earlier to develop a parallel Cartesian nested dissection heuristic that computes a ll reducing ordering for a matrix with an embedd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2014
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.07.020